leanTAP: Lean Tableau-Based Theorem Proving (Extended Abstract)
نویسندگان
چکیده
“prove((E,F),A,B,C,D) :!, prove(E,[F|A],B,C,D). prove((E;F),A,B,C,D) :!, prove(E,A,B,C,D), prove(F,A,B,C,D). prove(all(H,I),A,B,C,D) :!, \+length(C,D), copy_term((H,I,C),(G,F,C)), append(A,[all(H,I)],E), prove(F,E,B,[G|C],D). prove(A,_,[C|D],_,_) :((A= -(B); -(A)=B)) -> (unify(B,C); prove(A,[],D,_,_)). prove(A,[E|F],B,C,D) :prove(E,F,[A|B],C,D).” implements a first-order theorem prover based on free-variable semantic tableaux. It is complete, sound, and efficient.
منابع مشابه
Logic Programming as a Basis for Lean Deduction: Achieving Maximal Efficiency from Minimal Means
Researchers in Automated Reasoning often complain that there are sparse applications of the techniques they develop. One reason might be that implementation-oriented research favors huge and highly complex systems and that this does not suit the needs of many applications.1 It is hard to see how to apply these systems – besides using them as a black box. Adaptability, however, is an important c...
متن کاملLogic Programming as a Bases for Lean Deduction: Achieving Maximal Efficiency from Minimal Means
Researchers in Automated Reasoning often complain that there are sparse applications of the techniques they develop. One reason might be that implementation-oriented research favors huge and highly complex systems and that this does not suit the needs of many applications.1 It is hard to see how to apply these systems – besides using them as a black box. Adaptability, however, is an important c...
متن کاملLean Theorem Proving: Maximal Efficiency from Minimal Means
5 prove(Lit,[Next|UnExp],Lits,FreeV,VLim) :prove(Next,UnExp,[Lit|Lits],FreeV,VLim). plain that there are sparse applications of the techniques they develop. One reason might be that implementation-oriented research favors huge and highly complex systems. It is hard to see how to apply these besides using them as a black box. Adaptability, however, is an important criterion for applying techniqu...
متن کاملalpha-leanTAP: A Declarative Theorem Prover for First-Order Classical Logic
We present αleanTAP , a declarative tableau-based theorem prover written as a pure relation. Like leanTAP, on which it is based, αleanTAP can prove ground theorems in first-order classical logic. Since it is declarative, αleanTAP generates theorems and accepts non-ground theorems and proofs. The lack of mode restrictions also allows the user to provide guidance in proving complex theorems and t...
متن کاملLeant a P: Lean Tableau-based Theorem Proving
implements a rst-order theorem prover based on free-variable semantic tableaux. It is complete, sound, and eecient.
متن کامل